Method, system, and article of manufacture for returning physical volumes

ABSTRACT

Provided are a method, system and article of manufacture for return processing in storage pools. A plurality of physical volumes are allocated to a first storage pool. A determination is made whether the first storage pool has more than a threshold number of empty physical volumes. If the first storage pool has more than the threshold number of empty physical volumes, then at least one empty physical volume is returned to a second storage pool.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to a method, system, and an articleof manufacture for returning physical volumes.

[0003] 2. Description of the Related Art

[0004] In prior art virtual tape storage systems, hard disk drivestorage emulates tape drives and tape cartridges. For instance, hostsystems perform input/output (I/O) operations with respect to a tapelibrary by performing I/O operations with respect to a set of hard diskdrives that emulate the tape library. In prior art virtual tape storagesystems, such as the International Business Machines (IBM) Magstar**Virtual Tape Server, at least one virtual tape server (VTS) is coupledto a tape library comprising numerous tape drives and tape cartridges.The VTS is also coupled to a direct access storage device (DASD),comprised of numerous interconnected hard disk drives.

[0005] The DASD functions as a cache to volumes in the tape library. InVTS operations, the VTS processes the host's requests to access a volumein the tape library and returns data for such requests, if possible,from the cache. If the volume is not in the cache, then the VTS recallsthe volume from the tape library to the cache, i.e., the VTS transfersdata from the tape library to the cache. The VTS can respond to hostrequests for volumes that are present in the cache substantially fasterthan requests for volumes that have to be recalled from the tape libraryto the cache. However, since the capacity of the cache is relativelysmall when compared to the capacity of the tape library, not all volumescan be kept in the cache. Hence, the VTS also premigrates volumes fromthe cache to the tape library, i.e., the VTS transfers data from thecache to the tape cartridges in the tape library.

[0006] The tape library may comprise a plurality of storage pools. Eachstorage pool may comprise of zero, one or a plurality of tapecartridges. Requests from a host may identify a storage pool into whichparticular data should be written into.

[0007] Notwithstanding the use of storage pools in a virtual tapelibrary, there is a need in the art for improved techniques for managingstorage pools in virtual tape library systems.

SUMMARY OF THE PREFERRED EMBODIMENTS

[0008] Provided are a method, system and article of manufacture forreturn processing in storage pools. A plurality of physical volumes areallocated to a first storage pool. A determination is made whether thefirst storage pool has more than a threshold number of empty physicalvolumes. If the first storage pool has more than the threshold number ofempty physical volumes, then at least one empty physical volume isreturned to a second storage pool. In certain implementations, thereturned physical volume is the one that has undergone more usage thanother empty physical volumes present in the first storage pool.

[0009] In further implementations, the first storage pool is a datapool, the second storage pool is a scratch pool, the first storage poolis capable of borrowing additional physical volumes in the first storagepool from the second storage pool, and the threshold number is three.

[0010] Additional implementations provide a method, system, and articleof manufacture for return processing in storage pools. A determinationis made whether a first storage pool has been updated within a firstelapsed time period. If the first storage pool has not been updatedwithin the first elapsed time period then a number of physical volumesto remain in the first storage pool is set to zero, the borrowing ofphysical volumes to the first storage pool from a second storage pool isdisabled, and the returning of physical volumes from the first storagepool is allowed.

[0011] In further implementations, normal returning and borrowing isallowed in the first storage pool if the first storage pool been beenupdated within a second elapsed time period, wherein the second elapsedtime period is less than the first elapsed time period.

[0012] In yet further implementations, a determination is made whetherthe first storage pool has been updated within a second elapsed timeperiod, wherein the second elapsed time period is less than the firstelapsed time period. If the first storage pool has not been updatedwithin the second elapsed time period the number of physical volumes toremain in the first storage pool is set to three, the borrowing ofphysical volumes to the first storage pool from a second storage pool isdisabled, and the returning of physical volumes from the first storageis allowed.

[0013] The implementations achieve substantially uniform utilization ofthe physical volumes by providing improved techniques for returningphysical volumes to the scratch pool after the physical volumes havebeen used and are empty. In certain implementations, at least threeempty physical volumes that have been used the least are left in eachstorage pool. Certain implementations also reduce the unnecessaryborrowing and returning of physical volumes by limiting the borrow andreturn processes to be used with recently active pools. Furthermore,when a pool has been inactive for an extended period of time, emptyphysical volumes from the inactive pool may be returned to the scratchpool. Therefore, physical volumes are shared and reused more often bydata pools and are used substantially uniformly.

BRIEF DESCRIPTION OF THE DRAWINGS

[0014] Referring now to the drawings in which like reference numbersrepresent corresponding parts throughout:

[0015]FIG. 1 illustrates a block diagram of a computing environment, inaccordance with certain described aspects of the invention;

[0016]FIG. 2 illustrates a block diagram of physical volumes dividedinto pools, in accordance with certain described implementations of theinvention;

[0017]FIG. 3 illustrates a block diagram of pool data structures, inaccordance with certain described implementations of the invention;

[0018]FIG. 4 illustrates a block diagram of physical volume datastructures, in accordance with certain described implementations of theinvention;

[0019]FIG. 5 illustrates via a flow diagram and a corresponding table aprocess by which a physical volume spends entire life cycles in the samepool, in accordance with certain described implementations of theinvention;

[0020]FIG. 6 illustrates via a flow diagram and a corresponding table aprocess by which a physical volume is borrowed from a pool and thensubsequently returned to the original pool, in accordance with certaindescribed implementations of the invention;

[0021]FIG. 7 illustrates via a flow diagram and a corresponding table aprocess by which a physical tape volume is borrowed into a pool, used inthe pool, and then reused in the same pool, in accordance with certaindescribed implementations of the invention;

[0022]FIG. 8 illustrates logic for updating the active data timestamp inthe pool data structure, in accordance with certain describedimplementations of the invention;

[0023]FIG. 9 illustrates logic for borrowing and returning physicalvolumes for a pool, in accordance with certain described implementationsof the invention;

[0024]FIG. 10 illustrates logic for return processing of physicalvolumes, in accordance with certain described implementations of theinvention;

[0025]FIG. 11 illustrates logic for borrow processing of physicalvolumes, in accordance with certain described implementations of theinvention;

[0026]FIG. 12 illustrates a table that indicates borrowing policies thatmay be applied to physical volumes, in accordance with certain describedimplementations of the invention;

[0027]FIG. 13 illustrates logic for borrow processing of physicalvolumes based on certain borrowing policies, in accordance with certaindescribed implementations of the invention; and

[0028]FIG. 14 illustrates a block diagram of a computer architecture inwhich certain described aspects of the invention are implemented.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0029] In the following description, reference is made to theaccompanying drawings which form a part hereof and which illustrateseveral implementations. It is understood that other implementations maybe utilized and structural and operational changes may be made withoutdeparting from the scope of the present implementations.

[0030]FIG. 1 illustrates a computing environment utilizing a VirtualTape Server (VTS) 100. Additional VTSs can be deployed, but for purposesof illustration, a single VTS 100 is shown. The VTS 100 is any servercomputational device known in the art and includes any operating systemknown in the art. For instance, in certain implementations of theinvention, the VTS 100 may be implemented in one or more computerscomprising an IBM RS/6000** system and include the IBM AIX** operatingsystem.

[0031] A plurality of hosts 102 a, 102 b, . . . , 102 n connect to theVTS 100. The hosts 102 a . . . 102 n may connect to the VTS 100 througha host data interface 103 channel, such as the Enterprise SystemConnection (ESCON)** channel or any other direct connection or switchingmechanism known in the art (e.g., fibre channel, Storage Area Network(SAN) interconnections, etc.). The hosts 102 a . . . 102 n may be anycomputational device known in the art, such as a personal computer, aworkstation, a server, a mainframe, a hand held computer, a palm topcomputer, a telephony device, network appliance, etc. The hosts 102 a .. . 102 n may include any operating system known in the art, such as theIBM OS/390** operating system.

[0032] The VTS 100 includes at least one central processing unit (CPU)104 and an application, such as a storage manager 105 that managesstorage. The storage manager 105 may be implemented either as astandalone application or as a part of one or more other applications.The storage manager 105 manages a cache 106, such as a DASD file buffer,and a physical library 108, such as a tape library. In certainimplementations, the storage manager 105 may include software to utilizea tape library, such as the IBM Magstar** Virtual Tape Server, and theIBM ADSTAR Distributed Management (ADSM) software or Tivoli** StorageManager. The storage manager 105 may perform or manage the data movementoperations between the hosts 102 a . . . 102 n, the cache 106, and thephysical library 108. Further details of the VTS technology aredescribed in the IBM publication “Magstar** Peer-to-Peer Virtual TapeServer Planning and Implementation Guide,” IBM document no. SG24-6115-00(Copyright IBM, 2000), which publication is incorporated herein byreference in its entirety.

[0033] The physical library 108 may comprise an IBM Magstar* TapeLibrary, such as the Magstar** 3494 Tape Library, or any other tapelibrary system known in the art. In certain implementations, thephysical library 108 comprises numerous physical devices 110 a, 110 b, .. . 110 n, such as tape drives, CD ROM drives, DVD ROM drives, etc. Thephysical library 108, in addition to including the physical devices 110a . . . 110 n, includes physical volumes 114 a . . . 114 n. A physicalvolume may be mounted on any of the physical devices 110 a . . . 110 n.The physical volumes 114 a . . . 114 n may be of a variety of mediatypes such as tape cartridges, CD ROMs, DVDs, etc. In certainimplementations the physical volumes 114 a . . . 114 n may be mountedvia mechanical loading onto the physical devices 110 a . . . 110 n. Thenumber of physical volumes 114 a . . . 114 n are larger than the numberof physical devices 110 a . . . 100 n.

[0034] The cache 106 may comprise numerous interconnected hard diskdrives. The cache 106 improves performance by allowing host I/O requestsfrom the hosts 102 a . . . 102 n to the physical library 108 to beserviced from the faster access cache 106 as opposed to the sloweraccess physical library 108. The disks in the cache may be arranged as aDirect Access Storage Device (DASD), Just a Bunch of Disks (JBOD),Redundant Array of Inexpensive Disks (RAID), etc. The storage manager105 maps the cache 106 to a plurality of logical (virtual) devices (notshown). The hosts 102 a . . . 102 n perform I/O operations by accessinglogical (virtual) volumes 116 a . . . 116 n in the logical devices viathe VTS 100. The storage manager 105 maps the logical volumes 116 a . .. 116 n to the physical volumes 114 a . . . 114 n. Thus, the logicalvolumes 116 a . . . 116 n in the cache 106 correspond to the physicalvolumes 114 a . . . 114 n in the physical library 108. The logicalvolumes 116 a . . . 116 n resident on the cache 106 may change overtime. The storage manager 105 attempts to keep the more likely to beused logical volumes 116 a . . . 116 n in the cache. Although the hosts102 a . . . 102 n may access data via the logical volumes, the data isphysically stored in the physical volumes 114 a . . . 114 n mountable onthe physical devices 110 a . . . 110 n.

[0035] When a host 102 a . . . 102 n writes a logical volume to the VTS100, the data is stored as a file in the cache 106. The cached data islater migrated onto a physical volume 114 a . . . 114 n. The originallogical volume is left in the cache 106 for cache hits. When the cache106 fills to a predetermined threshold, the logical volume data for aselected logical volume 116 a . . . 116 n is removed from the cache tofree space for more logical volumes. In certain implementations, thestorage manager 105 removes from the cache 106 a selected logical volume(selected from the logical volumes 116 a . . . 116 n) that has beenresident on the cache 106 for the longest period of time.

[0036] When a host 102 a . . . 102 n requests a logical volume from theVTS 100, a cache hit occurs if the logical volume is resident in thecache 106. If the logical volume is not resident in the cache, then thestorage manager 105 determines whether the corresponding physical volume114 a . . . 114 n is mounted on one of the physical devices 110 a . . .110 n. If the corresponding physical volume 114 a . . . 114 n is notmounted then the storage manager 105 mounts the corresponding physicalvolume 114 a . . . 114 n on one of the physical devices 110 a . . . 110n. The data for the logical volume is then transferred back, i.e.,recalled, from the corresponding physical volume 114 a . . . 114 n.

[0037] Physical volumes 114 a . . . 114 n may be logically divided intoone or more storage pools (hereinafter referred to as pools) 120 a . . .120 n, where each pool 120 a . . . 120 n has zero, one or more physicalvolumes 114 a . . . 114 n. The hosts 102 a . . . 102 n may specify aparticular pool 120 a . . . 120 n while reading and writing data via theVTS 100 by accessing a logical volume 116 a . . . 116 n. In certainimplementations, each customer using the VTS 100 may have the customer'sdata stored on a separate pool 120 a . . . 120 n, thereby segregatingeach customer's data on a different subset of physical volumes 114 a . .. 114 n. The division of the physical volumes 114 a . . . 114 n intopools 120 a . . . 120 n may be done for a variety of other reasons,including for storing different types of data in different pools, etc.

[0038] An application, such as, a library manager 122, is coupled to theVTS 100 to manage the physical library 108 including the pools 120 a . .. 120 n. In alternative implementations, the library manager 122 may becoupled to the physical library 108 or to any other computational device(not shown). The library manager 122 may either be a standaloneapplication or be part of any other application or subsystem, such as,the storage manager 105, the VTS 100, the physical library 108 etc. Thelibrary manager 122 may interact with various data structures such as aphysical volume data structure 124 and a pool data structure 126. Thephysical volume data structure 124 includes attributes of datastructures related to the physical volumes 114 a . . . 114 n, and thepool data structure 126 include attributes of data structures related tothe pools 120 a . . . 120 n. The physical volume data structure 124 andthe pool data structure 126 may be implemented in the VTS 100 in anymanner known in the art, such as via tables, linked lists, etc. Thelibrary manager 122 interacts with a library manager database 130, wherethe library manager database 130 may store information regarding thepools 120 a . . . 120 n and the physical volumes 114 a . . . 114 n. Incertain implementations, the library manager database 130 includesvarious instances of the physical volume data structure 124 and the pooldata structure 126. The library manager database 130 may be any databaseknown in the art such as a relational, hierarchical or object orienteddatabase management system. An application, such as a physical volumemonitor 132 may also be included in the VTS 100, where the physicalvolume monitor 132 may monitor the functioning of the physical volumes114 a . . . 114 n. A table or an equivalent data structure, such as aborrowing policy table 134 may also be included in the VTS 100. Theborrowing policy table 132 may contain rules for borrowing physicalvolumes 114 a . . . 114 n from one pool to another. In alternativeimplementations, the information contained in the borrowing policy table132 may be contained in other data structures, such as in the pool datastructure 126, and the borrowing policy table 132 may be absent. Inalternative implementations, the library manager database 130, thephysical volume data structure 124, the pool data structure 126, thephysical volume monitor 132, and the borrowing policy table 132 may becoupled to the physical library 108 or to any other computational device(not shown).

[0039] A customer input 136 for data from the VTS 100 maybe conveyed tothe VTS 100 via a host 102 a . . . 102 n (for illustration purposes thecustomer input 136 is shown coupled to host 102 n). The customer input136 many include requests for reading or writing data, where therequests are conveyed by the hosts 102 a . . . 102 n to the VTS 100. Inalternative implementations, the customer input 136 may be made directlyto the VTS 100 without involving the hosts 102 a . . . 102 n. Customerinput 136 may specify a pool 120 a . . . 120 n that is associated withthe data. In such a case the VTS 100 may satisfy the customer requestfrom the specified pool 120 a . . . 120 n. In certain alternativeimplementations, the VTS 100 or the library manager 122 may associate aspecific pool 120 a . . . 120 n with a specific customer input 136, evenwhen the specific customer input 136 does not specify any particularpool 120 a . . . 120 n.

[0040] Other alternative implementations of storage systems that do notconform to the illustrated computing environment may also be used forimplementations of the invention. For example, storage systems differentfrom a VTS may be used for alternative implementations of the invention.As long as storage pools 120 a . . . 120 n can be constructed from aplurality of physical volumes, implementations of the invention may beimplemented in a variety of computing environments.

[0041]FIG. 2 is a block diagram illustrating how physical volumes (suchas physical volumes 114 a . . . 114 n) may be divided into pools 120 a .. . 120 n, in accordance with certain implementations of the invention.While a specific example of dividing physical volumes 114 a . . . 114 ninto pools is shown, other variations in which the physical volumes 114a . . . 114 n are divided into pools 120 a . . . 120 n in a differentway are included within the scope of the implementations of theinvention.

[0042] The pool 120 a is also a scratch pool 120 a and may include alarge number of physical volumes 114 a . . . 114 s selected from thephysical volumes 114 a . . . 114 n. In certain implementations, thescratch pool 120 a may include over a thousand physical volumes. Thescratch pool 120 a includes physical volumes of two differenttypes,—type “J” (illustrated by reference numerals 114 a . . . 114 j)and type “K” (illustrated by reference numerals 114 k . . . 114 s). Type“J” and type “K” physical volumes have different characteristics. Forexample, one type of physical volume may be capable of storing a largeramount of data when compared to the other type. However, access time forthe type capable of storing a larger amount of data may be slower whencompared to the access time of the other type. While only two types ofphysical volumes have been shown, the scratch pool 120 a may include alesser or a greater number of types of physical volumes. The physicalvolumes 114 a . . . 114 s included in the scratch pools 120 a have noactive data, i.e., the physical volumes 114 a . . . 114 j are eitherempty, have data that has expired, or contain data that may beoverwritten by the hosts 102 a . . . 102 n.

[0043] In certain implementations of the inventions, the plurality ofpools 120 b . . . 120 n may borrow and return physical volumes to thescratch pool 120 a. The plurality of pools 120 b . . . 120 n may also bereferred to as data pools or active pools as data maybe written intophysical volumes when physical volumes are present in pools 120 b . . .120 n. In FIG. 2, pool 120 b has physical volumes of type J and type K,pool 120 c has physical volumes of type J only, and pool 120 n hasphysical volumes of type K only. A pool 120 b . . . 120 n may borrow aphysical volume from the scratch pool 120 a when additional data needsto be written that cannot be accommodated into the existing physicalvolumes within the pool 120 b . . . 120 n. When a physical volume is nolonger required by a pool 120 b . . . 120 n, the physical volume may bereturned to the scratch pool 120 a.

[0044] The scratch pool 120 a allows the sharing of a large number ofphysical volumes 114 a . . . 114 s, among the pools 120 b . . . 120 n.When a pool 120 b . . . 120 n needs a physical volume for writingadditional data, the new physical volume may be borrowed from thescratch pool 120 a. A physical volume may be returned to the scratchpool 120 a after the physical volume has been used by a pool 120 b . . .120 n. In the absence of the scratch pool 120 a, each pool 120 b . . .120 n may need to be permanently assigned with a fixed set of physicalvolumes.

[0045]FIG. 3 illustrates a block diagram of the pool data structure 126,in accordance with certain described implementations of the invention.The pool data structure 126 may reside in the virtual tape server 100.The pool data structure 126 is associated with each pool 120 a . . . 120n, i.e., each pool 120 a . . . 120 n has an instance of the pool datastructure 126. In certain implementations, the instances of the pooldata structures 126 for each pool 120 a . . . 120 n may be constructedby the library manager 128 and stored in the library manager database130. In alternative implementations other processes in the VTS 100 mayconstruct the instances of the pool data structure 126 and store theinstances in locations different from the library manager database 130.

[0046] A first field of the pool data structure 126 is a “First mediachoice for borrow” field 302. The entry of the field 302 for aparticular pool indicates the preferred type of physical volume 114 a .. . 114 n that the particular pool may borrow from the scratch pool 120a. In certain implementations, the preferred type for the entry of field302 may be chosen from (i) “none”, (ii) type “J”, (iii) type “K”, (iv)either of type “J” or type “K”, where “J” and “K” are media types fordifferent types of physical volumes. If the “first media choice forborrow” field 302 is “none” for a particular pool, then the particularpool is not allowed to borrow physical volumes of any type. Otherwise,the entry of field 302 reflects the type(s) of physical volumes that maybe borrowed by a pool.

[0047] A second field of the pool data structure 126 is a “Second mediachoice for borrow” field 304. The entry of field 304 for a particularpool indicates the second choice of the type of physical volume 114 a .. . 114 n that the particular pool may borrow from the scratch pool 120a. In certain implementations, the preferred type for the entry of field302 may be chosen from (i) neither of J or K, (ii) type J, (iii) type K,where J and K are media types for different types of physical volumes.

[0048] A third field of the pool data structure 126 is a “Returnborrowed physical volumes to scratch pool” field 306. If the field 306is “yes” for a particular pool, then the particular pool may return aphysical volume 114 a . . . 114 n to the scratch pool 120 a after thephysical volume 114 a . . . 114 n is empty. If the field 206 is “no” fora particular pool, then the particular pool may not return a physicalvolume to the scratch pool 120 a, i.e., the physical volume is apermanent member of the particular pool.

[0049] A fourth field of the pool data structure 126 is an “active datatimestamp” field 308. The field 308 for a particular pool includes thetime when data on the particular pool was accessed for any purpose,including in response to read or write requests from the hosts 102 a . .. 102 n. The “active data timestamp” field may be reset to zero.

[0050]FIG. 4 illustrates a block diagram of the physical volume datastructure 124, in accordance with certain implementations of theinvention. Each physical volume 114 a . . . 114 n has an instance of thephysical volume data structure 124 coupled to the physical volume 114 a. . . 114 n. In certain implementations, the instances of the physicalvolume data structure for each physical volume 114 a . . . 114 n may beconstructed by the library manager 128 and stored in the library managerdatabase 130. In alternative implementations other processes in the VTS100 may construct the instances of the physical volume data structure126 and store the instances in locations different from the librarymanager database 130.

[0051] A first field of the physical volume data structure 124 is a“permanently assigned to a pool” field 402. If the “permanently assignedto a pool” field 402 for a particular physical volume indicates aspecific pool 120 a . . . 120 n, then the particular physical volume ispermanently assigned to the specific pool 120 a . . . 120 n. In certainimplementations, such permanent assignments may take place when theparticular physical volume is to be used exclusively by one user or aparticular application. The permanent assignment of a particularphysical volume to a storage pool 120 a . . . 120 n may be accomplishedusing an user interface associated with the library manager 128, duringthe time when the physical volumes 114 a . . . 114 n are first insertedinto the physical library 108.

[0052] If a particular physical volume is permanently assigned to a pooland the pool is not a scratch pool, then the particular physical volumewill at some point in time have data written into the particularphysical volume. Even after all the data written to the particularphysical volume has expired or has been removed, the physical volumestill stays assigned to the pool.

[0053] A second field of the physical volume data structure 124 is a“current pool” field 404 indicating the pool in which a physical volume114 a . . . 114 n is currently present. For example, if the “currentpool” field of a particular physical volume is pool 120 b, then theparticular physical volume is currently present in pool 120 b.

[0054] A third field of the physical volume data structure 124 is a“home pool” field 406 indicating the pool to which a specific physicalvolume 114 a . . . 114 n should be returned to whenever the specificphysical volume 114 a . . . 114 n is empty. In certain implementationsof the invention, the home pool field 406 for a physical volume 114 a .. . 114 n is the scratch pool 120 a. For example, if the “home pool”field of a particular physical volume is the scratch pool 120 a, thenthe particular physical volume may be returned to the scratch pool 120 aafter the particular physical volume has been in some pool other thanthe scratch pool 120 a.

[0055] In certain implementations of the invention the “permanentlyassigned to pool” field 402 is not used, and a physical volume isassumed to be permanently assigned to the current pool of the physicalvolume if the “home pool” field 406 of the physical volume equals the“current pool” field 404 of the physical volume.

[0056] A fourth field of the physical volume data structure 124 is a“scratch count” field 408 indicating the number of the times a physicalvolume 114 a . . . 114 n has been borrowed and used. The value in the“scratch count” field 408 for a particular physical volume is anindicator of the total number of times the particular physical volumehas been used since the physical volume 114 a . . . 114 n was new. Inalternative implementations the “scratch count” field 408 for aparticular physical volume may reflect the number of times theparticular physical volume was returned.

[0057] A fifth field of the physical volume data structure 124 is an“empty or active” field 410. If field 410 is labeled as “active” for aparticular physical volume then there is valid data on the particularphysical volume and the physical volume is in use. If field 408 islabeled as “empty” for a particular physical volume then there is novalid data on the particular physical volume and new data can be writtenon the physical volume.

[0058] A sixth field of the physical volume data structure 124 is a“reserved by process” field 412. The field 412 may contain the identityof a process that has the physical volume associated with the physicalvolume data structure 124 reserved for the process.

[0059] A seventh field of the physical volume data structure 124 is a“locked by thread” field 414. The field 414 may contain the identity ofa thread that has the physical volume associated with the physicalvolume data structure 124 locked by the thread. Such locking may benecessary when the physical volume associated with the physical volumedata structure 124 is being updated. There may also be other reasons forlocking a physical volume.

[0060] An eighth field of the physical volume data structure 124 is an“error condition” field 416. The field 416 may contain an error codethat reflects an error condition associated with the processing of thephysical volume corresponding to the physical volume data structure 124.

[0061] A ninth field of the physical volume data structure 124 is an“eject processing flag” field. The field 418 may indicate that thephysical volume corresponding to the physical volume data structure 124is marked for eject processing.

[0062] Alternative implementations of the invention may merge or not usecertain of the of the nine fields 402, 404, 406, 408, 410, 412, 414,416, 418, or use a subset of the nine fields 402, 404, 406, 408, 410,412, 414, 416, 418 in different storage devices.

[0063]FIG. 5 illustrates via a flow diagram 500 and a correspondingtable 502, a process in which a physical volume spends the entire lifecycle of the physical volume in the same pool, in accordance withcertain implementations of the invention. Operations shown in the flowdiagram of FIG. 5 may be performed by the library manager 122, or by anyother process coupled to the VTS 100.

[0064] The flow diagram 500 illustrates a pool N 504, where the pool N504 may be one pool out of the pools 120 a . . . 120 n. The pool N 504has a physical volume, where the physical volume has the name PV0001.The current pool 404 and the home pool 406 of the physical volume isalways pool N. The “return borrowed physical volume to scratch pool”flag 306 for the physical volume is permanently assigned to “no”. Atstep A 506 the physical volume is empty. The various fields in thephysical volume data structure 124 of the physical volume and the pooldata structure 126 of the pool N 504 during the execution of step A 506are shown in row 502 a of table 502.

[0065] Subsequent to step A, data is written to the physical volumeduring the course of step B 508 and the physical volume becomes full,i.e., there is no further space to write data into the physical volume.The various fields in the physical volume data structure 124 and thepool data structure 126 at the conclusion of step B 508 are shown in row502 b of table 502.

[0066] Subsequent to step B, the physical volume undergoes step C 510and becomes empty. In certain implementations, the physical volumeundergoes step C 510 when the data in the physical volume expires or isno longer required for some other reason. In alternativeimplementations, small amounts of data remaining on the physical volume(an initial physical volume) can be transferred to another physicalvolume, emptying the initial physical volume. The various fields in thephysical volume data structure 124 and the pool data structure 126 atthe conclusion of step C 508 are shown in row 502 c of table 502.

[0067]FIG. 5 illustrates the situation where a physical volume spendsthe entire life cycle of the physical volume in the same pool. Since thecurrent pool and home pools of the physical volume are pool N and pool Ndoes not return physical volumes, the physical volume spends the entirelife cycle of the physical volume in the same pool, i.e. in pool N 504.The physical volume alternates between empty and full state repeatedlyinside pool N 504.

[0068]FIG. 6 illustrates via a flow diagram 600 and a correspondingtable 602, a process by which a physical volume is borrowed from ascratch pool and then subsequently returned to the scratch pool, inaccordance with certain described implementations of the invention.Operations shown in the flow diagram of FIG. 6 may be performed by thelibrary manager 122, or by any other process coupled to the VTS 100.

[0069] The flow diagram 600 illustrates a pool M 604 and a pool N 606,where the pools M 604 and N 606 may be selected from the pools 120 a . .. 120 n. A physical volume, where the physical volume has the namePV0002 may move between pool M 604 and pool N 606. The home pool 606 ofthe physical volume is always pool M 604. The “return borrowed physicalvolume to scratch pool” flag 306 for pool N 606 is permanently assignedto “Yes”.

[0070] At step A 608 the physical volume is empty and is present in poolM 604. The various fields in the physical volume data structure 124 forthe physical volume and the pool data structure 126 for pool N duringstep A 608 are shown in row 602 a of table 602.

[0071] Subsequent to step A, during step B 610 the empty physical volumeis borrowed by pool N 606 from pool M 604. The various fields in thephysical volume data structure 124 of the physical volume and the pooldata structure 126 of pool N 606 at the conclusion of step B 610 areshown in row 602 b of table 602. As a result of the movement of thephysical volume from pool M 604 to pool N 606 the “current pool” field404 of the physical volume changes to pool N in row 602 b (the currentpool 404 of the physical volume was pool M during step A, as shown inrow 602 a).

[0072] Subsequent to step B, during step C 612 the empty physical volumeis written into in pool M and becomes full at the conclusion of step C612. The various fields in the physical volume data structure 124 forthe physical volume and the pool data structure 126 for pool N at theconclusion of step C 612 are shown in row 602 c of table 602.

[0073] Subsequent to step C, during step D 614 the filled physicalvolume is emptied and at the conclusion of step D 614, the physicalvolume is in the empty state in pool N 606. The various fields in thephysical volume data structure 124 for the physical volume and the pooldata structure 126 for pool N at the conclusion of step D 614 are shownin row 602 d of table 602.

[0074] Subsequent to step D, during step E 616 the empty physical volumeis returned from pool N 606 to the “home pool” 406, i.e., the emptyphysical volume is returned to pool M 604. At the conclusion of step E616, the physical volume is in the empty state in pool M 604. Thevarious fields in the physical volume data structure 124 of the physicalvolume and the pool data structure 126 for pool N at the conclusion ofstep E 616 are shown in row 602 e of table 602. Since the home pool ofthe physical volume is pool M 604, and in pool N 606 the “returnborrowed physical volume to scratch pool” flag 306 for pool N 606 ispermanently assigned to “Yes”, the physical volume can be returned frompool N 606 to the home pool 406 (i.e., pool M 604).

[0075] In the VTS 100, the pool M 604 is the scratch pool 120 a.Therefore, FIG. 6 illustrates a process where a physical tape isborrowed from a scratch pool to a pool, used in the pool and returnedback to the scratch pool when the pool is empty.

[0076]FIG. 7 illustrates via a flow diagram 700 and a correspondingtable 702, a process by which a physical tape volume is borrowed into apool, used in the pool and then reused in the pool, in accordance withcertain described implementations of the invention. Operations shown inthe flow diagram of FIG. 7 may be performed by the library manager 122,or by any other process coupled to the VTS 100.

[0077] The flow diagram 700 illustrates a pool M 704 and a pool N 706,where the pools M 704 and N 706 may be selected from the pools 120 a . .. 120 n. A physical volume, where the physical volume has the namePV0003 may move between pool M 604 and pool N 606. The home pool 706 ofthe physical volume is always pool M 704. The “return borrowed physicalvolume to scratch pool” flag 306 for pool N 706 is permanently assignedto “No”.

[0078] At step A 608 the physical volume is empty and the physicalvolume is present in pool M 704. The various fields in the physicalvolume data structure 124 for the physical volume and the pool datastructure 126 for pool N 706 during step A 708 are shown in row 702 a oftable 702.

[0079] Subsequent to step A, during step B 710 the empty physical volumeis borrowed by pool N 706 from pool M 704. The various fields in thephysical volume data structure 124 for the physical volume and the pooldata structure 126 for the pool N 706 at the conclusion of step B 710are shown in row 702 b of table 702. As a result of the movement of thephysical volume from pool M 704 to pool N 706, the “current pool” 404 ofthe physical volume changes to pool N in row 602 b (the current pool 404of the physical volume was pool M during step A 708, as shown in row 702a).

[0080] Subsequent to step B, during step C 712 the empty physical volumein pool M 704 is written into and the empty physical volume becomes fullat the conclusion of step C 712. The various fields in the physicalvolume data structure 124 and the pool data structure 126 at theconclusion of step C 712 are shown in row 702 c of table 702.

[0081] Subsequent to step C, during step D 714 the filled physicalvolume is emptied and at the conclusion of step D 714, the physicalvolume is in the empty state in pool N 706. The various fields in thephysical volume data structure 124 for the physical volume and the pooldata structure 126 for pool N 706 at the conclusion of step D 714 areshown in row 702 d of table 602. The pool M 706 does not return thephysical volume to pool M 704 (or any other pool) because the “returnborrowed physical volume to scratch pool” flag 306 for pool N 706 ispermanently assigned to “No”. Hence, the empty physical volume is reusedagain and again in pool N 706.

[0082] In the VTS 100, the pool M 704 is the scratch pool 120 a.Therefore, FIG. 7 illustrates a process where a physical volume isborrowed from a scratch pool to a pool, and used and reused in the poolwithout returning the physical volume to the scratch pool.

[0083] For managing storage pools borrow and return rules can bespecified in multiple physical volume pool systems and the rules mayencompass the assignment of physical volume to the various pools. Ascratch pool may be maintained such that physical volumes may be sharedamong a plurality of active pools. When an active pool does not have anyavailable physical volume, the active pool may borrow a physical volumefrom the scratch pool. Subsequently, after the active pool has used thephysical volume and does not need the physical volume any further, theactive pool may return the physical volume to the scratch pool. Data canbe segregated into different storage pools. In addition, mechanisms formanaging storage pools allow more efficient usage of physical volumes byallowing the sharing and reuse of physical volumes among a plurality ofactive pools.

[0084] Determining When to Borrow and Return Physical Volumes

[0085] An active pool is a pool that contains at least one physicalvolume that has been modified, i.e., new data has been written in thephysical volume or existing data in the physical volume has beenremoved. At any instant of time, some data pools 120 b . . . 120 n maybe pools that are not active. In certain implementations, the borrowingand returning of physical volumes are performed only by those data pools120 b . . . 120 n that are active pools.

[0086]FIG. 8 illustrates logic for updating the “active data timestamp”field 308 in the pool data structure to facilitate the borrowing andreturning of physical volumes, in accordance with certain describedimplementations of the invention. The logic may be performed by thephysical volume monitor 132, the library manager 122, the VTS 100, or byany other process coupled to the VTS 100, such as the storage manager105.

[0087] The process starts at block 802, where for each data pool 120 b .. . 120 n during online processing the “active data timestamp” field 308for the pool data structure 126 is initialized to “zero.” During onlineprocessing, each data pool is processed such that appropriate physicalvolumes are borrowed and returned for each data pool.

[0088] Control proceeds to block 804, where the VTS 100 queues a filefor premigration to a selected pool 120 b . . . 120 n in the physicallibrary 108. Thus, the time of last update of data in the selected pool120 b . . . 120 n in the physical library 108 is the time at which theVTS 100 queues the file for premigration to the selected pool 120 b . .. 120 n. At block 806, the “active data timestamp” field 308 of the pooldata structure 126 corresponding to the selected pool 120 b . . . 120 nis updated with the time at which the VTS queued the file forpremigration. At the conclusion of block 806, the “active datatimestamp” field 308 for a selected pool 120 b . . . 120 n contains thetime at which data in the pool 120 b . . . 120 n was last updated.Control returns to block 804, and the logic of blocks 804 and 806 arerepeated as the VTS 100 keeps queuing additional files for premigration.

[0089]FIG. 9 illustrates logic for borrowing and returning physicalvolumes for a pool, in accordance with certain described implementationsof the invention. The logic is performed by the physical volume monitor132. In alternative implementations, the logic may be performed by thelibrary manager 122, the VTS 100, or by any other process coupled to theVTS 100, such as the storage manager 105. The physical volume monitor132 processes each data pool 120 b . . . 120 n such that each data pool120 b . . . 120 n returns and borrows physical volumes according to thelogic illustrated in FIG. 9.

[0090] The logic starts at block 900, where the physical volume monitor132 starts checking a selected data pool 120 b . . . 120 n for returnand borrow processing. Control proceeds to block 902, where the physicalvolume monitor 132 determines if the “active data timestamp” field 308corresponding to the pool data structure 126 of the selected data pool120 b . . . 120 n is “zero”. If so, no change in data has taken place inthe selected data pool 120 b . . . 120 n since the last onlineprocessing (i.e., return and borrow processing). Therefore, no borrowingfrom the scratch pool 120 a or returning to the scratch pool 120 a isneeded. Control proceeds to block 904, where the physical volume monitor132 disables borrowing and returning for the selected data pool 120 b .. . 120 n and the process stops (at block 920) for the selected datapool 120 b . . . 120 n.

[0091] If at block 902, the physical volume monitor 132 determines thatthe “active data timestamp” field 308 corresponding to the pool datastructure 126 of the selected data pool 120 b . . . 120 n is not “zero”then control proceeds to block 906. At block 906, the physical volumemonitor 132 determines if the “active data timestamp” field 308 lags thecurrent time by more than a threshold time, N. In certainimplementations, N is set to “72 hours”, i.e., block 906 determines ifthe “active data timestamp” field 308 is more than 72 hours behind thecurrent time.

[0092] If at block 906, the “active data timestamp” field 308 lags thecurrent time by greater than the threshold, N, then control proceeds toblock 908 where the physical volume monitor 132 sets the number of emptyphysical volumes to remain in the selected data pool 120 b . . . 120 nto zero, disables the borrowing of empty physical volumes for theselected data pool 120 b . . . 120 n, and enables the returning ofphysical volumes from the selected data pool 120 b . . . 120 n to thescratch pool 120 a. The rationale for these settings are as follows. Theselected data pool 120 b . . . 120 n has not been active for an extendedperiod of time N. The likelihood (when compared to other data pools) ofthe selected data pool needing an empty physical volume is low.Therefore, by restricting borrowing more physical volumes are freed upin the scratch pool 120 a. Returning is enabled because if data expiresin the selected data pool 120 b . . . 120 n, physical volumes should bereturned to the scratch pool 120 a. Since the likelihood of an update inthe selected data pool 120 b . . . 120 n is low, there is no need toretain any empty volumes in the selected data pool 120 b . . . 120 n.

[0093] Control proceeds to block 910 where the physical volume monitor132 determines if there is data in the selected data pool 120 b . . .120 n. If so, control proceeds to block 920 where the process stops.

[0094] If at block 910, the physical volume monitor 132 determines thatthere is no data in the selected data pool 120 b . . . 120 n thencontrol proceeds to block 912 where the physical volume monitor 132resets the “active data timestamp” field 308 of the selected data pool120 b . . . 120 n to “zero”. The sequence of blocks 900, 902, 906, 908,910 and 912 may ensure the return of empty physical volumes in aselected data pool 120 b . . . 120 n to the scratch pool 120 a andresets the “active data timestamp” 308 of the selected data pool 120 b .. . 120 n to “zero”.

[0095] If at block 906, the physical volume monitor 132 determines thatthe “active data timestamp” 308 does not lag the current time by greaterthan the threshold, N, control proceeds to block 914. At block 914, thephysical volume monitor 132 determines if the “active data timestamp”field 308 lags the current time by a threshold, M, where M <=N. Incertain implementations, M may be 48 hours when N is 72 hours. If so,control proceeds to block 916 where the physical volume monitor 132 setsthe number of empty physical volumes to remain at three for the selecteddata pool 120 b . . . 120 n, disables borrowing for the selected datapool 120 b . . . 120 n and enables returning for the selected data pool120 b . . . 120 n. The rationale for these settings are as follows.Although the selected pool 120 b . . . 120 n has been active at sometime period between M and N (where M<=N), the selected pool 120 b . . .120 n has been inactive for at least the period M. Therefore, theselected data pool 120 b . . . 120 n has been inactive in the recentpast. Hence, by allowing up to three empty volumes to remain in theselected data pool 120 b . . . 120 n there is likely to be enough roomfor updates on the selected data pool and by restricting borrowing morephysical volumes are freed up in the scratch pool 120 a. Controlproceeds to block 920 where the process stops.

[0096] If at block 914, the physical volume monitor 132 determines thatthe “active data timestamp” field 308 does not lag the current time by athreshold, M, where M<=N, control proceeds to block 918, where theselected data pools 120 b . . . 120 n may perform normal return andborrow processing as described in FIGS. 2, 5, 6 and 7. At block 918, thephysical volume monitor 132 sets the number of empty physical volumes toremain to three for the selected pools 120 b . . . 120 n and enablesboth borrowing and returning for the selected pools 120 b . . . 120 n.The rationale for these settings are as follows. The selected data pool120 b . . . 120 n has been active recently. Therefore, by allowing up tothree empty volumes to remain in the selected data pool 120 b . . . 120n there is likely to be a large enough buffer of empty physical volumes114 a . . . 114 n for updates on the selected data pool and by enablingborrowing more physical volumes 114 a . . . 114 n can be borrowed fromthe scratch pool 120 a as needed. At the conclusion of 918, controlproceeds to block 920 where the process stops.

[0097] The implementations reduce the unnecessary borrowing andreturning of physical volumes by adjusting the manner in which borrowand return processes are used with data pools. When a data pool has beeninactive for an extended period of time, empty physical volumes from theinactive pool may be returned to the scratch pool and borrowing disabledfor the data pool. When a data pool has been active recently, up tothree physical volumes may be kept as a buffer for the data pool, andthe data pool may borrow additional volumes from the scratch pool asneeded. When a data pool has not been active recently but has not beeninactive for an extended period of time, borrowing may be disabled forthe data pool but the data pool may still be allowed to maintain abuffer of three empty physical volumes. Therefore, there is a decreaseddemand for empty physical volumes on the scratch pool and physicalvolumes are shared and reused more often by data pools in the entiresystem.

[0098] Return Processing of Storage Pools

[0099] When physical volumes are reused, it may be better to reusephysical volumes uniformly, i.e., all physical volumes are used forapproximately the same amount of time. By reusing each physical volumefor approximately the same amount of time, the possibility of errors ina particular physical volume through overuse is reduced. Certainimplementations achieve substantially uniform utilization of thephysical volumes by providing improved techniques for returning physicalvolumes to the scratch pool 120 a after the physical volumes have beenused and are empty.

[0100]FIG. 10 illustrates logic for return processing of physicalvolumes, in accordance with certain described implementations of theinvention. The logic is performed by the physical volume monitor 132. Inalternative implementations, the logic may be performed by the librarymanager 122, the VTS 100, or by any other process coupled to the VTS100, such as the storage manager 105. The physical volume monitor 132processes each data pool 120 b . . . 120 n such that each data pool 120b . . . 120 n returns physical volumes to the scratch pool 120 aaccording to the logic illustrated in FIG. 10.

[0101] The logic starts at block 1000, with the physical volume monitor132 waiting for message. While the physical volume monitor 132 mayperform additional functions, a particular thread of the physical volumemonitor 132 may be dedicated towards waiting or the message that maypotentially trigger the returning of physical volumes 114 a . . . 114 n.Depending on the message, control may proceed to any of blocks 1002,1004 and 1006. At block 1002 the physical volume monitor 132 receives amessage that a certain fixed amount of time has elapsed. In certainimplementations, such a message may be received every hour. At block1004, the physical volume monitor 132 receives a message that a systemwide update (i.e., a reconcile on the VTS 100) has taken place. Asystemwide update involves reconciliation of all data in the VTS 100,the cache 106 and the physical library 108, such that the physicallibrary 108 possesses the latest updated copy of all data. At block1006, the physical volume monitor 132 receives a notification fromanother process that a particular physical volume has become empty.

[0102] From either of blocks 1002 or 1004 control proceeds to block1008, where a variable “POOL” representing an index into the data pools120 b . . . 120 n is assigned the integer “one”. The index indicates theselected data pool 120 b . . . 120 n that is under return processing bythe physical volume monitor 132. The total number of data pools 120 b .. . 120 n is N and therefore a valid index into the data pools 120 b . .. 120 n ranges from 1 to N.

[0103] Control proceeds to block 1010, where the physical volume monitor132 determines whether the variable “POOL” is greater than N, where N isthe total number of data pools 120 b . . . 120 n. If so, control returnsto block 1000 because all data pools 120 b . . . 120 n have beenprocessed for return processing. Otherwise, control proceeds to block1012 where the physical volume monitor 132 may determine if returning ofphysical volumes is enabled for the data pool being currently processedby executing the logic described in FIG. 9 in blocks 900-920. In theprocess described in blocks 900-920 certain data pools had returning ofphysical volumes disabled and certain data pools had returning ofphysical volumes enabled based on the “active data timestamp” field 308of the data pools. Furthermore, the process described in blocks 900-920also determined the number of empty physical volumes R to retain. Henceat block 1012, as part of determining whether returning of physicalvolumes is enabled for the data pool being currently processed thenumber of empty physical volumes to retain is also determined. If atblock 1012, it is determined that returning of physical volumes isenabled for the data pool being currently processed control proceeds toblock 1014. At block 1014, the physical volume monitor 132 may recordthe number of empty physical volumes R to retain in the pool beingcurrently processed (the number R was already determined while executingthe logic of block 1012 as part of the processing of blocks 900-920).

[0104] Control proceeds to block 1016 where for each data pool thephysical volume monitor 132 creates a list of candidate physical volumesfor return to the scratch pool 120 a. The candidate physical volumes areselected from the physical volumes 114 a . . . 114 n, where eachcandidate physical volume satisfies the following five conditions. Thefirst condition is that the “home pool” field 406 of a candidatephysical volume is the scratch pool 120 a (therefore, the candidatephysical volume can be returned to the scratch pool 120 a). The secondcondition is that the current pool of a candidate physical volume has“yes” for the “return borrowed physical volumes to scratch pool flag”field 306 (therefore, the current pool of the candidate physical volumeallows return of the candidate physical volume to the scratch pool 120a). The third condition is that there is no valid entry for the“reserved by process” field 412 of the physical volume data structure124 (therefore, the candidate physical volume is not reserved by anyparticular process). The fourth condition is that there is no validentry for the “error condition” field 416 of the physical volume datastructure 124 (therefore, there is no error condition associated withthe candidate physical volume). The fifth condition is that there is novalid entry for the “locked by thread” field 414 (therefore, thecandidate physical volume is not locked by any thread).

[0105] After the list of candidate physical volumes has been created inblock 1016, control proceeds to block 1018 where the candidate physicalvolumes are sorted based on the “scratch count” 408 of each physicalvolume. The “scratch count” field 408 indicates the number of the timesa physical volume 114 a . . . 114 n has been borrowed and used. Thevalue in the “scratch count” field 408 for a particular physical volumeis an indicator of the total number of times the particular physicalvolume has been used since the physical volume 114 a . . . 114 n wasnew. Therefore, the sorted list of candidate physical volumes reflectsthe relative frequency of prior usage of the candidate physical volumes.

[0106] Control proceeds to block 1020, where for each data pool 120 b .. . 120 n the physical volume monitor 132 returns physical volumes fromthe sorted candidate physical volumes starting with the physical volumewith the highest scratch count until only R physical volumes remain ineach data pool 120 b . . . 120 n. As determined in block 1014, R may bezero or three depending on the number of physical volumes R to retain inthe data pool being processed. Note that the logic of blocks 900-920restricted R to be either zero or three. The physical volumes arereturned to the scratch pool 120 a.

[0107] Leaving three physical volumes in each data pool 120 b . . . 120n ensures that even if the storage manager 105 starts using an emptyphysical volume in a data pool 120 b . . . 120 n while the logic of FIG.10 is being executed, there would still be at least two empty physicalvolumes in each data pool 120 a . . . 120 n when the logic of FIG. 10has completed execution. Having at least three empty physical volumes ineach data pool ensures a buffer of physical volumes to reduce repeatedborrowing of physical volumes from the scratch pool 120 a. Inalternative implementations, the number of physical volumes left in eachdata pool 120 b . . . 120 n may be less than or greater than three. Instill further implementations, different data pools 120 b . . . 120 nmay have a different number of physical volumes left after thecompletion of the logic of block 1020. In certain situations where R iszero, no physical volume is left in the data pool being processed as thedata pool has been inactive too long.

[0108] At the conclusion of block 1020, control proceeds to block 1022where the physical volume monitor 132 optionally increments the “scratchcount” field 408 of the physical volumes not returned to the scratchpool 120 a in block 1020. In alternative implementations, the “scratchcount” field 408 may be incremented elsewhere.

[0109] Control proceeds to block 1024, where the physical volume monitor132 increments the “POOL” variable so that the next pool from the datapool 120 b . . . 120 n may be considered for return processing. Controlreturns to block 1010 where the next data pool 120 b . . . 120 n isconsidered for return processing.

[0110] If at block 1012, the physical volume monitor 132 determines thatthe returning of data pools is disabled then control proceeds to block1024. Also, at the conclusion of block 1006, control proceeds to block1026 where the particular physical volume that became empty in block1006 is returned to the scratch pool 120 a. At block 1016 only onephysical volume is returned to the scratch pool 120 a. Control returnsto block 1000.

[0111] Return processing achieves substantially uniform utilization ofthe physical volumes by providing improved techniques for returningphysical volumes to the scratch pool 120 a after the physical volumeshave been used and are empty. In certain implementations of returnprocessing, at least three empty physical volumes that have been usedthe least are left in each storage pool. Certain implementations ofreturn processing also reduce the unnecessary borrowing and returning ofphysical volumes by limiting the borrow and return processes to be usedwith recently active pools. Furthermore, when a pool has been inactivefor an extended period of time, empty physical volumes from the inactivepool may be returned to the scratch pool. Therefore, physical volumesare shared and reused more often by data pools and are usedsubstantially uniformly.

[0112] Borrow Processing of Storage Pools

[0113] To ensure processing of information in a data storage pool 120 b. . . 120 n, the data storage pool 120 b . . . 120 n may contain areserve of empty physical volumes. The physical volume monitor 132 maymanage the borrowing of physical volumes 114 a . . . 114 n into the datastorage pools 120 b . . . 120 n to help ensure that each data storagepool 120 b . . . 120 n has an adequate number of empty physical volumes.In certain implementations, the empty physical volumes are borrowed fromthe scratch pool 120 a.

[0114] A small reserve of empty physical volumes in a data pool 120 b .. . 120 n ensures that when additional updates to the data pool 120 b .. . 120 n require additional storage space, such additional storagespace is available on the empty physical volumes that have already beenborrowed into the data pool 120 b . . . 120 n. If such empty physicalvolumes had not already been borrowed, additional time may have to bespent to borrow empty physical volumes from the scratch pool 120 a whenupdates are made to a data storage pool 120 b . . . 120 n. During borrowprocessing, the physical volume monitor 132 borrows an adequate numberof empty physical volumes 114 a . . . 114 n into data pools 120 b . . .120 n by anticipating the requirement for the empty physical volumes 114a . . . 114 n in the data storage pools 120 b . . . 120 n.

[0115]FIG. 11 illustrates logic for borrow processing of physicalvolumes, in accordance with certain implementations of the invention.The logic is performed by the physical volume monitor 132. Inalternative implementations, the logic maybe performed by the librarymanager 122, the VTS 100, or by any other process coupled to the VTS100, such as the storage manager 105. The physical volume monitor 132processes each data pool 120 b . . . 120 n such that each data pool 120b . . . 120 n borrows physical volumes from the scratch pool 120 aaccording to the logic illustrated in FIG. 11.

[0116] Processing starts at block 1100 with the physical volume monitor132 waiting for a message that may potentially trigger the borrowing ofphysical volumes 114 a . . . 114 n from the scratch pool 120 a. Whilethe physical volume monitor 132 may perform additional functions, aparticular thread of the physical volume monitor 132 may be dedicatedtowards waiting for the message that may potentially trigger theborrowing of physical volumes 114 a . . . 114 n. At block 1100, all datapools 120 b . . . 120 n are also marked as “unprocessed for borrowing”by the physical volume monitor 132.

[0117] At the completion of the logic described in block 1100, controlmay proceed to either block 1102 or 1104. At block 1102 the physicalvolume monitor 132 receives a message that indicates that a certainfixed amount of time has elapsed since the receipt of the last suchmessage. In certain implementations, such a message may be received bythe physical volume monitor 132 every two minutes. At block 1104 thephysical volume monitor 132 receives a message that indicates that aread-write mount of a physical volume 114 a . . . 114 n has taken place.

[0118] From either of blocks 1102 or 1104 control proceeds to block1106, where a variable “POOL” representing an index into the data pools120 b . . . 120 n is assigned the integer “one”. The index indicates aselected data pool 120 b . . . 120 n that is under borrow processing bythe physical volume monitor 132. The total number of data pools 120 b .. . 120 n is N and therefore a valid index into the data pools 120 b . .. 120 n ranges from 1 to N.

[0119] Control proceeds to block 1108, where the physical volume monitor132 determines whether the variable “POOL” is greater than N, where N isthe total number of data pools 120 b . . . 120 n. If so, control returnsto block 1100 because all data pools 120 b . . . 120 n have beenprocessed for return processing. Otherwise, control proceeds to block1110, where the physical volume monitor 132 determines if borrowing isenabled for the selected data pool (the logic of block 900-920 may havedisabled certain data pools 120 b . . . 120 n for borrowing). Ifborrowing is not enabled for the selected data pool then borrowprocessing should not be performed for the selected data pool andcontrol proceeds to block 1116 where the variable “POOL” is incremented(i.e., the next data pool 120 b . . . 120 n is selected for potentialborrow processing). Control returns to block 1108.

[0120] If at block 1110, the physical volume monitor 132 determines thatborrowing is enabled for the selected data pool then control proceeds toblock 1112 where the physical volume monitor 132 determines if theselected data pool has at least two empty physical volumes, for each ofwhich the following four conditions are satisfied. The first conditionis that the at least two empty physical volumes are read-write volumes,i.e., data can be read from the physical volumes and written into thephysical volumes. The second condition is that the “eject processingflag” field 418 of the physical volume data structure 124 is not markedfor eject processing (i.e., the at least two empty physical volumes arenot marked for eject processing). The third condition is that there isno valid entry for the “error condition” field 416 of the physicalvolume data structure 124 (therefore, there is no error conditionassociated with the at least two empty physical volumes). The fourthcondition is that there is no valid entry for the “locked by thread”field 414 (therefore, the at least two empty physical volumes are notlocked by any thread).

[0121] If at block 1112 it is determined that the data pool does nothave least two empty physical volumes that satisfy the four conditionscontrol proceeds to block 1114. At block 1114, the physical volumemonitor 132 borrows empty physical volumes as per certain borrowingrules (the borrowing rules will be described in FIGS. 12 and 13) intothe selected data pool such that at the completion of block 1114 thedata pool has two empty physical volumes. Further details of theborrowing techniques used in block 1114 will be described in FIG. 13.Therefore, if the data pool does not have any empty physical volume thatsatisfy the four conditions then the data pool borrows two emptyphysical volumes from the scratch pool 120 a. If the data pool has oneempty physical volume that satisfies the four conditions, then the datapool borrows one empty physical volume from the scratch pool 120 a.Control proceeds to block 1116.

[0122] If at block 1112 the physical volume monitor 132 determines thatthe data pool has at least two empty physical volumes then controlproceeds to block 1116 because there is no need to borrow any additionalempty physical volume to the data pool.

[0123] The logic of FIG. 11 ensures that each data pool 120 b . . . 120n has at least two empty physical volumes thereby ensuring that whenadditional updates to the data pool 120 b . . . 120 n require additionalstorage space such additional storage space is available on the at leasttwo empty physical volumes that have already been borrowed into the datapool 120 b . . . 120 n.

[0124]FIG. 12 illustrates details of the borrowing policy table 134 thatindicates borrowing policies that may be applied to borrow physicalvolumes 114 a . . . 114 n, in accordance with certain implementations ofthe invention. The borrowing policy table 134 contains rules that areused by the physical volume monitor 132 to determine which physicalvolumes 114 a . . . 114 n to borrow from a scratch pool 120 a into adata pool 120 b . . . 120 n.

[0125] In certain implementations there are two different types ofphysical volumes 114 a . . . 114 n. The two different types of physicalvolumes are of the “J” media type and the “K” media type. Physicalvolumes 114 a . . . 114 n that are borrowed from the scratch pool 120 amay be borrowed according to certain borrowing policies. The “firstmedia choice for borrow” field 302 and the “second media choice forborrow” field 304 in the pool data structure 126 corresponding to a datapool 120 b . . . 120 n may be used in association with the borrowingpolicy table 134 to determine what type of physical volume to borrowinto a data pool 120 b . . . 120 n. The “first media choice for borrow”field 302 and the “second media choice for borrow” field 304 can be setto one of four values indicating the media type that the correspondingdata pool may borrow. The four values are (1) “J” media type; (2) “K”media type; (3) “either media type”; and (4) “none”. The borrowingpolicy table illustrates six combinations 1202, 1204, 1206, 1208, 1210,1212 of the settings of the “first media choice for borrow” field 302and the “second media choice for borrow” field 304 that are meaningful.The borrowing policy table 134 shows these six combinations 1202, 1204,1206, 1208, 1210, 1212 with entries for the “first media type to borrow”1214, the “second media type to borrow” 1216, the “interpretation” 1218and the and the “precedence for borrowing” 1220 corresponding to each ofthe six combinations 1202, 1204, 1206, 1208, 1210, 1212. In the“precedence for borrowing” 1216 entries with a lower numeric valueindicate a higher precedence for borrowing, i.e., “1” has the highestprecedence and “3” the lowest precedence. In the borrowing policy table132 the entries for the “first media type to borrow” 1214, the “secondmedia type to borrow” 1216, and the “interpretation” 1218 are shown tofacilitate the description of implementations and these entries may beomitted in the borrowing policy table 134 in the implementations.

[0126] As an example of the entries in the borrowing policy table 134,for the borrowing case “J-K” 1206 the “first media type to borrow” 1214is “J”, the “second media type to borrow” 1216 is “K”. The“interpretation” 1218 is that the second media type “K” is borrowed onlywhen no media types of the first media type “K” are available in thescratch pool 120 a. The “precedence of borrowing” 1220 is “2” for theborrowing case “J-K” 1206.

[0127]FIG. 13 illustrates logic for borrow processing of physicalvolumes 114 a . . . 114 n based on the borrowing policy table 134, inaccordance with certain implementations of the invention; The logic isperformed by the physical volume monitor 132. In alternativeimplementations, the logic may be performed by the library manager 122,the VTS 100, or by any other process coupled to the VTS 100, such as thestorage manager 105. The physical volume monitor 132 processes each datapool 120 b . . . 120 n such that each data pool 120 b . . . 120 nreturns physical volumes to the scratch pool 120 a according to thelogic illustrated in FIG. 13.

[0128] Processing starts at block 1300 where the physical volume manager132 queries the storage manager 105 for the empty physical volumes onwhich reads and writes can be performed in the data pools 120 b . . .120 n. Control proceeds to block 1302 where the physical volume monitor132 counts the number of such empty physical volumes in each data pool120 b . . . 120 n based on the response from the storage manager 105. Inalternative implementations, the physical volume monitor 132 maydetermine the number of empty physical volumes 132 on which reads andwrites can be performed without the assistance of the storage manager105.

[0129] Control proceeds to block 1304 where the physical volume monitor132 categorizes the data pools 120 b . . . 120 n that have less than twoempty physical volumes into one of the six borrowing cases 1202, 1204,1206, 1208, 1210, 1212 of the borrowing policy table 134. The physicalvolume monitor 132 performs the categorization of each data pool basedon the “first media choice for borrow” 302 field and the “second mediachoice for borrow” field 304 of the pool data structure 126corresponding to each data pool. For example, if for a data pool the“first media choice for borrow 302 field is “J” and the “second mediachoice for borrow” filed 304 is “K” then the data pool is categorizedunder the borrowing case “J-K” 1206.

[0130] At the conclusion of the logic of block 1304, all data pools thathave less than two empty physical volumes are part of one of the sixborrowing cases 1202, 1204, 1206, 1208, 1210, 1212. For example,physical volumes 114 c, 114 d, 114 e, 114 g may all be categorized underthe borrowing case “K-J” 1208.

[0131] Control proceeds to block 1306 where the physical volume monitor132 begins processing the data pools categorized under the borrowingcase with the highest precedence. Control proceeds to block 1308, wherea first cycle is made through the data pools categorized under theborrowing case to select the data pools that have no empty physicalvolumes. For the data pools with no empty physical volumes, the physicalvolume monitor 132 borrows one physical volume 114 a . . . 114 n of anappropriate media type according to the borrowing rules laid down in theborrowing policy table 134 for the borrowing case of the data poolsbeing processed. If there is more than one physical volume of theappropriate media type that can be borrowed from the scratch pool 120 a,the physical volume with the lowest “scratch count” 408 is borrowed,i.e., while borrowing the least used physical volumes are borrowedthereby providing substantially uniform usage of all physical volumes.At the conclusion of block 1308, all data pools that started block 1308with no empty physical volume have one empty physical volume and alldata pools that started block 1308 with one empty physical volume hasone empty physical volume.

[0132] Control proceeds to block 1310, where in a second cycle throughthe data pools categorized under the borrowing case the physical volumemonitor 132 borrows one physical volume 114 a . . . 114 n of anappropriate media type according to the borrowing rules laid down in theborrowing policy table 134 for the borrowing case of the data poolsbeing processed that still need empty physical volumes. If there is morethan one physical volume of the appropriate media type that can beborrowed from the scratch pool 120 a, the physical volume with thelowest “scratch count” 408 is borrowed. The conclusion of block 1310completes the processing of data pools categorized for one borrowingcase.

[0133] The advantage of borrowing empty physical volumes in two cyclesis that in the first cycle only data pools with no empty physicalvolumes borrow one empty physical volume. Only when each data pool hasat least one empty physical volume can the data pools attempt to borrowa second physical volume. Having two cycles is advantageous insituations where the scratch pool 120 a runs out of physical volumes ofa particular type.

[0134] Control proceeds to block 1312 where the physical volume monitor132 determines whether data pools corresponding to all borrowing caseshave been processed. If not, control returns to block 1306, where thephysical volume monitor 132 begins processing the remaining unprocessedpools categorized under the borrowing case with the highest precedence.The loop formed by block 1306, 1308, 1310, 1312 maybe executed six timescorresponding to the six borrowing cases 1202, 1204, 1206, 1208, 1210,1212.

[0135] If at block 1312, a determination is made that data poolscorresponding to all borrowing cases 1202, 1204, 1206, 1208, 1210, 1212have been processed control proceeds to block 1314 where the physicalvolume monitor 132 waits for a message to perform another round ofborrow processing through all data pools 120 b . . . 120 n.

[0136] In certain implementations of the invention, during the executionof the logic of FIG. 13 the scratch pool 120 a may run out physicalvolumes of one media type. In such a case, borrowing is still performedfor data pools that can borrow the other media type. Should the scratchpool 120 a run out of both media types, borrow processing stops. Thelibrary manager 122 may be informed when the scratch pool 120 a runs outof physical volumes of a particular media type. The logic of FIG. 8ensures that physical volumes are borrowed from the scratch pool 120 aaccording to the policies laid down in the borrowing policy table 134.An attempt is made to keep two empty physical volumes in data pool 120 b. . . 120 n by appropriate borrowing strategies.

[0137] Borrow processing ensures a small reserve of empty physicalvolumes for each data pool 120 b . . . 120 n. Physical volumes 114 a . .. 114 n are borrowed from the scratch pool 120 a when a data pool 120 b. . . 120 n does not have at least two empty physical volumes. Whileborrowing, the least used physical volumes are borrowed from the scratchpool 120 a thereby ensuring substantially uniform utilization of thedata pools. Via the mechanisms of borrowing and returning theimplementations of the invention maintain neither too few nor too manyempty physical volumes in each data pool. Also, the combination ofborrowing precedence and satisfying a first borrow for all poolsfollowed by a second borrow for all pools ensures that a limited numberof a specific media type is distributed fairly among those pools thatmost require that media type.

[0138] Additional Implementation Details

[0139] The described techniques may be implemented as a method,apparatus or article of manufacture using standard programming and/orengineering techniques to produce software, firmware, hardware, or anycombination thereof. The term “article of manufacture” as used hereinrefers to code or logic implemented in hardware logic (e.g., anintegrated circuit chip, Programmable Gate Array (PGA), ApplicationSpecific Integrated Circuit (ASIC), etc.) or a computer readable medium(e.g., magnetic storage medium, such as hard disk drives, floppy disks,tape), optical storage (e.g., CD-ROMs, optical disks, etc.), volatileand non-volatile memory devices (e.g., EEPROMs, ROMs, PROMs, RAMs,DRAMs, SRAMs, firmware, programmable logic, etc.). Code in the computerreadable medium is accessed and executed by a processor. The code inwhich implementations are made may further be accessible through atransmission media or from a file server over a network. In such cases,the article of manufacture in which the code is implemented may comprisea transmission media, such as a network transmission line, wirelesstransmission media, signals propagating through space, radio waves,infrared signals, etc. Of course, those skilled in the art willrecognize that many modifications may be made to this configurationwithout departing from the scope of the implementations, and that thearticle of manufacture may comprise any information bearing medium knownin the art.

[0140]FIG. 14 illustrates a block diagram of a computer architecture inwhich certain aspects of the invention are implemented. FIG. 14illustrates one implementation of the VTS 100 and the hosts 102 a . . .102 n. The VTS 100 and the hosts 102 a . . . 102 n may implement acomputer architecture 1400 having a processor 1402 (e.g., amicroprocessor, such as the CPU 104), a memory 1404 (e.g., a volatilememory device), and storage 1406 (e.g., a non-volatile storage, magneticdisk drives, optical disk drives, tape drives, etc.). The storage 1406may comprise an internal storage device, an attached storage device or anetwork accessible storage device. Programs in the storage 1406 may beloaded into the memory 1404 and executed by the processor 1402 in amanner known in the art. The architecture may further include a networkcard 1408 to enable communication with a network. The architecture mayalso include at least one input 1410, such as a keyboard, a touchscreen,a pen, voice-activated input, etc., and at least one output 1412, suchas a display device, a speaker, a printer, etc.

[0141] The logic of FIGS. 5-11 and 13 describe specific operationsoccurring in a particular order. Further, the operations may beperformed in parallel as well as sequentially. In alternativeimplementations, certain of the logic operations may be performed in adifferent order, modified or removed and still implement implementationsof the present invention. Morever, steps may be added to the abovedescribed logic and still conform to the implementations. Yet furthersteps maybe performed by a single process or distributed processes.

[0142] While the hosts 102 a . . . 102 n and the VTS 100 communicatewithin a client-server paradigm in the described implementations, thehosts 102 a . . . 102 n and the VTS 100 may also communicate within apeer-to-peer or any other paradigm known in the art. Furthermore, manyof the software and hardware components have been described in separatemodules for purposes of illustration. Such components may be integratedinto a fewer number of components or divided into a larger number ofcomponents. Additionally, certain operations described as performed by aspecific component may be performed by other components.

[0143] While implementations of the invention have been described with ascratch pool, alternative implementations may be constructed whereactive pools may borrow and return physical volumes among the activepools (without involving a scratch pool) to reuse and share physicalvolumes. Alternative implementations may also be constructed with morethat one scratch pool. In alternative implementations, the functions ofa scratch pool may be performed by an active pool.

[0144] The data structures shown in FIGS. 3 and 4 show the datastructures as having specific types of information. In alternativeimplementations, the physical volume data structure 124 and the pooldata structure 126 may have fewer, more or different fields than shownin the figures. The borrowing policy table 134 may also be constructeddifferently and may contain different information than shown in FIG. 12.

[0145] Certain groups of elements shown in the figures have been labeledwith reference numerals having an identical numeric prefix followed bythe suffix “a”, the suffix “b”, or the suffix “n”. For example, thephysical volumes are labeled 114 a, 114 b, . . . 114 n and the logicalvolumes are labeled 116 a, 116 b, . . . 116 n. Labeling groups ofelements in such a manner does not imply that different groups ofelements contain an identical number of elements in each group. Forexample, the number of physical volumes 114 a . . . 114 n need not bethe same as the number of logical volumes 116 a . . . 116 n.

[0146] Therefore, the foregoing description of the implementations hasbeen presented for the purposes of illustration and description. It isnot intended to be exhaustive or to limit the invention to the preciseform disclosed. Many modifications and variations are possible in lightof the above teaching. It is intended that the scope of the invention belimited not by this detailed description, but rather by the claimsappended hereto. The above specification, examples and data provide acomplete description of the manufacture and use of the composition ofthe invention. Since many implementations of the invention can be madewithout departing from the spirit and scope of the invention, theinvention resides in the claims hereinafter appended.

What is claimed is:
 1. A method for return processing in storage pools,the method comprising: allocating a plurality of physical volumes to afirst storage pool; determining if the first storage pool has more thana threshold number of empty physical volumes; and if the first storagepool has more than the threshold number of empty physical volumes, thenreturning at least one empty physical volume to a second storage pool.2. The method of claim 1, wherein the returned physical volume hasundergone more usage than other empty physical volumes present in thefirst storage pool.
 3. The method of claim 1, further comprising:subsequent to allocating and prior to determining, receiving anindication that a systemwide update has taken place for the physicalvolumes.
 4. The method of claim 1, further comprising: subsequent toallocating and prior to determining, receiving an indication that afixed amount of time has elapsed since a previous attempt at returningat least one empty physical volume to a second storage pool.
 5. Themethod of claim 1, wherein the first storage pool is a data pool,wherein the second storage pool is a scratch pool, wherein the firststorage pool is capable of borrowing additional physical volumes in thefirst storage pool from the second storage pool, and wherein thethreshold number is three.
 6. A method for return processing in storagepools, the method comprising: determining if a first storage pool hasbeen updated within a first elapsed time period; and if the firststorage pool has not been updated within the first elapsed time period:(i) setting a number of physical volumes to remain in the first storagepool to zero; (ii) disabling borrowing of physical volumes to the firststorage pool from a second storage pool; and (iii) allowing returning ofphysical volumes from the first storage pool.
 7. The method of claim 6,further comprising: recording that the first storage pool has undergonethe return of empty physical volumes based on time, wherein recording ismade in a field coupled to the first storage pool, and wherein the fieldis also capable of recording update times of the first storage pool. 8.The method of claim 6, wherein the first storage pool is a data pool,wherein the second storage pool is a scratch pool, and wherein the firststorage pool borrows at least one physical volume from the secondstorage pool.
 9. The method of claim 6, wherein the determination ismade at periodic intervals by a monitor application that monitors thefirst storage pool and other storage pools.
 10. The method of claim 6,further comprising: allowing normal returning and borrowing in the firststorage pool if the first storage pool been updated within a secondelapsed time period, wherein the second elapsed time period is less thanthe first elapsed time period.
 11. The method of claim 6, furthercomprising: determining if the first storage pool has been updatedwithin a second elapsed time period, wherein the second elapsed timeperiod is less than the first elapsed time period; and if the firststorage pool has not been updated within the second elapsed time period:(i) setting the number of physical volumes to remain in the firststorage pool to three; (ii) disabling borrowing of physical volumes tothe first storage pool from the second storage pool; and (iii) allowingreturning of physical volumes from the first storage pool.
 12. A systemfor return processing in storage pools, the system comprising: a firststorage pool; a second storage pool; a plurality of physical volumes;means for allocating the plurality of physical volumes to the firststorage pool; means for determining if the first storage pool has morethan a threshold number of empty physical volumes; and means forreturning at least one empty physical volume to the second storage pool,if the first storage pool has more than the threshold number of emptyphysical volumes.
 13. The system of claim 12, wherein the returnedphysical volume has undergone more usage than other empty physicalvolumes present in the first storage pool.
 14. The system of claim 12,further comprising: means for receiving an indication that a systemwideupdate has taken place for the physical volumes.
 15. The system of claim12, further comprising: means for receiving an indication that a fixedamount of time has elapsed since a previous attempt at returning atleast one empty physical volume to a second storage pool.
 16. The systemof claim 12, wherein the first storage pool is a data pool, wherein thesecond storage pool is a scratch pool, wherein the first storage pool iscapable of borrowing additional physical volumes in the first storagepool from the second storage pool, and wherein the threshold number isthree.
 17. A system for return processing in storage pools, the systemcomprising: a first storage pool; a second storage pool; means fordetermining if the first storage pool has been updated within a firstelapsed time period; means for setting the number of physical volumes toremain in the first storage pool to zero if the first storage pool hasnot been updated within the first elapsed time period; means fordisabling borrowing of physical volumes to the first storage pool fromthe second storage pool if the first storage pool has not been updatedwithin the first elapsed time period; and means for allowing returningof physical volumes from the first storage pool if the first storagepool has not been updated within the first elapsed time period.
 18. Thesystem of claim 17, further comprising: means for recording that thefirst storage pool has undergone the return of empty physical volumesbased on time, wherein recording is made in a field coupled to the firststorage pool, and wherein the field is also capable of recording updatetimes of the first storage pool.
 19. The system of claim 17, wherein thefirst storage pool is a data pool, wherein the second storage pool is ascratch pool, and wherein the first storage pool borrows at least onephysical volume from the second storage pool.
 20. The system of claim17, wherein the determination is made at periodic intervals by a monitorapplication that monitors the first storage pool and other storagepools.
 21. The system of claim 17, further comprising: means forallowing normal returning and borrowing in the first storage pool if thefirst storage pool been updated within a second elapsed time period,wherein the second elapsed time period is less than the first elapsedtime period.
 22. The system of claim 17, further comprising: means fordetermining if the first storage pool has been updated within a secondelapsed time period, wherein the second elapsed time period is less thanthe first elapsed time period; means for setting the number of physicalvolumes to remain in the first storage pool to three, if the firststorage pool has not been updated within the second elapsed time period;means for disabling borrowing of physical volumes to the first storagepool from the second storage pool if the first storage pool has not beenupdated within the second elapsed time period; and means for allowingreturning of physical volumes from the first storage pool if the firststorage pool has not been updated within the second elapsed time period.23. An article of manufacture for return processing in storage pools,wherein the article of manufacture causes operations, the operationscomprising: allocating a plurality of physical volumes to a firststorage pool; determining if the first storage pool has more than athreshold number of empty physical volumes; and if the first storagepool has more than the threshold number of empty physical volumes, thenreturning at least one empty physical volume to a second storage pool.24. The article of manufacture of claim 23, wherein the returnedphysical volume has undergone more usage than other empty physicalvolumes present in the first storage pool.
 25. The article ofmanufacture of claim 23, the operations further comprising: subsequentto allocating and prior to determining, receiving an indication that asystemwide update has taken place for the physical volumes.
 26. Thearticle of manufacture of claim 23, the operations further comprising:subsequent to allocating and prior to determining, receiving anindication that a fixed amount of time has elapsed since a previousattempt at returning at least one empty physical volume to a secondstorage pool.
 27. The article of manufacture of claim 23, wherein thefirst storage pool is a data pool, wherein the second storage pool is ascratch pool, wherein the first storage pool is capable of borrowingadditional physical volumes in the first storage pool from the secondstorage pool, and wherein the threshold number is three.
 28. An articleof manufacture for return processing in storage pools, wherein thearticle of manufacture is capable of causing operations, the operationscomprising: determining if the first storage pool has been updatedwithin a first elapsed time period; and if the first storage pool hasnot been updated within the first elapsed time period: (i) setting thenumber of physical volumes to remain in the first storage pool to zero;(ii) disabling borrowing of physical volumes to the first storage poolfrom a second storage pool; and (iii) allowing returning of physicalvolumes from the first storage pool.
 29. The article of manufacture ofclaim 28, the operations further comprising: recording that the firststorage pool has undergone the return of empty physical volumes based ontime, wherein recording is made in a field coupled to the first storagepool, and wherein the field is also capable of recording update times ofthe first storage pool.
 30. The article of manufacture of claim 28,wherein the first storage pool is a data pool, wherein the secondstorage pool is a scratch pool, and wherein the first storage poolborrows at least one physical volume from the second storage pool. 31.The article of manufacture of claim 28, wherein the determination ismade at periodic intervals by a monitor application that monitors thefirst storage pool and other storage pools.
 32. The article ofmanufacture of claim 28, the operations further comprising: allowingnormal returning and borrowing in the first storage pool if the firststorage pool been updated within a second elapsed time period, whereinthe second elapsed time period is less than the first elapsed timeperiod.
 33. The article of manufacture of claim 28, the operationsfurther comprising: determining if the first storage pool has beenupdated within a second elapsed time period, wherein the second elapsedtime period is less than the first elapsed time period; and if the firststorage pool has not been updated within the second elapsed time period:(i) setting the number of physical volumes to remain in the firststorage pool to three; (ii) disabling borrowing of physical volumes tothe first storage pool from the second storage pool; and (iii) allowingreturning of physical volumes from the first storage pool.